Grid-enabled evolution strategies for large-scale home care crew scheduling
نویسندگان
چکیده
منابع مشابه
A Hybrid Approach for Solving Large Scale Crew Scheduling Problems
We consider several strategies for computing optimal solutions to large scale crew scheduling problems. Provably optimal solutions for very large real instances of such problems were computed using a hybrid approach that integrates mathematical and constraint programming techniques. The declarative nature of the latter proved instrumental when modeling complex problem restrictions and, particul...
متن کاملSolving Large Scale Crew Scheduling Problems by using Iterative Partitioning
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). NS operates about 30,000 trains a week. All these trains need a driver and a certain number of conductors. No available crew scheduling algorithm can solve such huge instances at once. A common approach to deal with these huge weekly instances, is to split them into sever...
متن کاملNegotiation Strategies for Grid Scheduling
Grid computing is considered the next step of distributed computing architectures. For such service oriented architectures the resource management is an important component that has to cope with the challenges of heterogeneous, decentralized and autonomous resources. The use of agreements is expected to become a key technology for the reliable interaction between resource providers and consumer...
متن کاملInteroperable Grid Scheduling Strategies
The increasing demand for resources of the high performance computing systems has led to new forms of collaboration of distributed systems such as interoperable grid systems that contain and manage their own resources. While with a single domain one of the most important tasks is the selection of the most appropriate set of resources to dispatch a job, in an interoperable grid environment this ...
متن کاملAn Algorithm for Large Scale 0-1 Integer Programming with Application to Airline Crew Scheduling
We present an approximation algorithm for solving large 0-1 integer programming problems where A is 0-1 and where b is integer. The method can be viewed as a dual coordinate search for solving the LP-relaxation, reformulated as an unconstrained nonlinear problem, and an approximation scheme working together with this method. The approximation scheme works by adjusting the costs as little as pos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cluster Computing
سال: 2017
ISSN: 1386-7857,1573-7543
DOI: 10.1007/s10586-017-1058-2